On large sets of t-designs of size four1
نویسندگان
چکیده
A set of well known necessary conditions for the existence of a large set of t-designs, LS[N ](t, k, v), is N ∣∣∣(v−i k−i) for i = 0, . . . , t. We investigate the existence of large sets of size four. We take advantages of the recursive and direct constructions to show that the trivial necessary conditions are sufficient when N = 4, t = 2, 3 and k ≤ 7.
منابع مشابه
On the existence of large sets of t-designs of prime sizes1
In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence...
متن کاملOn the Existence of Large Sets of t-designs of Prime Sizes
In this paper, we use the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence of...
متن کاملA family of large set of size nine
We investigate the existence of some large sets of size nine. The large set $LS[9](2,5,29)$ is constructed and existence of the family $LS[9](2,5,27l+j)$ for $lgeq 1, 2leq j
متن کاملRoot cases of large sets of t-designs
A large set of t-(v, k, λ) designs of size N , denoted by LS[N ](t, k, v), is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs, where N = ( v−t k−t ) /λ. A set of trivial necessary conditions for the existence of an LS[N ](t, k, v) is N ∣
متن کاملOn the Number of Mutually Disjoint Cyclic Designs
We denote by LS[N ](t, k, v) a large set of t-(v, k, λ) designs of size N , which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs and N = ( v−t k−t ) /λ. We use the notation N(t, v, k, λ) as the maximum possible number of mutually disjoint cyclic t-(v, k, λ)designs. In this paper we give some new bounds for N(2, 29, 4, 3) and N(2, 31, 4, 2). Consequently we presen...
متن کامل